Binary (generalized) Post Correspondence Problem
نویسندگان
چکیده
We give a new proof for the decidability of the binary Post Correspondence Problem (PCP) originally proved in 1982 by Ehrenfeucht, Karhum8 aki and Rozenberg. Our proof is complete and somewhat shorter than the original proof although we use the same basic idea. c © 2002 Elsevier Science B.V. All rights reserved.
منابع مشابه
Problem is in P TUCS Technical Report
We show that the binary (generalized) Post Correspondence Problem is decidable in polynomial time. We also give a characterization of morphisms with stable suffix complexity.
متن کاملReduction Tree of the Binary Generalized Post Correspondence Problem
An instance of the (Generalized) Post Correspondence Problem is during the decision process typically reduced to one or more other instances, called its successors. In this paper we study the reduction tree of GPCP in the binary case. This entails in particular a detailed analysis of the structure of end blocks. We give an upper bound for the number of end blocks, and show that even if an insta...
متن کاملSome New Results on Post Correspondence Problem and Its Modifications
In this work we shall consider some new result on the famous word problem called the Post Correspondence Problem (PCP), initially defined by E. Post. Halava, Hirvensalo and de Wolf [4] proved that the PCP is decidable if we assume that the morphisms are marked. Moreover, Halava, Harju and Hirvensalo [2] proved that even the generalized PCP is decidable in the case of marked morphisms. As a coro...
متن کاملRemarks on Generalized Post Correspondence Problem
It is shown that Post Correspondence Problem remains undecidable even in the case where one of the morphisms is xed. Accordingly the generalized PCP is undecidable even in the case where both of the morphisms are xed, and, moreover, the cardinality of their domain alphabet is 7. In particular, GPCP(7) is undecidable. On the other hand, GPCP(2) is not only decidable, but, as we show here, its al...
متن کاملPost Correspondence Problem with Partially Commutative Alphabets
We introduce a version of Post Correspondence Problem (PCP, in short) generalized to words over partially commutative alphabets. Several observations are presented about the algorithmic status of the introduced problem. In particular solvability is shown for the partially commutative PCP for two special cases: the binary case of PCP (denoted by PCP(2) ), and the case with one periodic morphism....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 276 شماره
صفحات -
تاریخ انتشار 2002